Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accelerated decomposition techniques for large discounted Markov decision processes

Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...

متن کامل

Dissertation Defense Iterative Methods and Partitioning Techniques for Large Sparse Problems in Network Analysis

First, additive Schwarz methods are a class of domain decomposition methods that are suitable for the solution of large linear systems in serial as well as in parallel mode. We adapt the Restricted Additive Schwarz (RAS) method to the computation of the stationary probability distribution vector of large, sparse, irreducible stochastic matrices. The convergence properties are analyzed and exten...

متن کامل

Comparison of Eigenvalue Solvers for Large Sparse Matrix Pencils

Efficient and accurate computation of eigenvalues and eigenvectors is of fundamental importance in the accelerator physics community. Moreover, the eigensystem analysis is generally used for the identifications of many physical phenomena connected to vibrations. Therefore, various types of algorithms such that Arnoldi, Lanczos, KrylovSchur, Jacobi-Davidson etc. were implemented to solve the eig...

متن کامل

Linear System Solvers : Sparse Iterative

In this chapter we will present an overview of a number of related iterative methods for the solution of linear systems of equations. These methods are so-called Krylov projection type methods and they include popular methods as Conjugate Gradients, Bi-Conjugate Gradients, LSQR and GMRES. We will sketch how these methods can be derived from simple basic iteration formulas, and how they are inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2000

ISSN: 1064-8275,1095-7197

DOI: 10.1137/s1064827598338159